#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,q,counter=0;
cin>>n>>q;
string x;
cin>>x;
for(int i=0;i<x.length()-1;i++)
{
if(x[i]=='.'&&x[i+1]=='.')
counter++;
}
while(q--)
{
int a;
char c;
cin>>a>>c;
if(c!='.')
{
if(a==1)
{
if(x[a-1]=='.')
{
if(x[a]=='.')
counter--;
}
x[a-1]=c;
}
else if(a==n)
{
if(x[n-1]=='.')
{
if(x[n-2]=='.')
counter--;
}
x[n-1]=c;
}
else
{
if(x[a-1]=='.')
{
if(x[a]=='.')
counter--;
if(x[a-2]=='.')
counter--;
}
x[a-1]=c;
}
}
else
{
if(a==1)
{
if(x[a-1]!='.')
{
if(x[a]=='.')
counter++;
}
x[a-1]=c;
}
else if(a==n)
{
if(x[n-1]!='.')
{
if(x[n-2]=='.')
counter++;
}
x[n-1]=c;
}
else
{
if(x[a-1]!='.')
{
if(x[a]=='.')
counter++;
if(x[a-2]=='.')
counter++;
}
x[a-1]=c;
}
}
cout<< counter<<"\n";
}
}
519A - A and B and Chess | 725B - Food on the Plane |
154B - Colliders | 127B - Canvas Frames |
107B - Basketball Team | 245A - System Administrator |
698A - Vacations | 1216B - Shooting |
368B - Sereja and Suffixes | 1665C - Tree Infection |
1665D - GCD Guess | 29A - Spit Problem |
1097B - Petr and a Combination Lock | 92A - Chips |
1665B - Array Cloning Technique | 1665A - GCD vs LCM |
118D - Caesar's Legions | 1598A - Computer Game |
1605A - AM Deviation | 1461A - String Generation |
1585B - Array Eversion | 1661C - Water the Trees |
1459A - Red-Blue Shuffle | 1661B - Getting Zero |
1661A - Array Balancing | 1649B - Game of Ball Passing |
572A - Arrays | 1455A - Strange Functions |
1566B - MIN-MEX Cut | 678C - Joty and Chocolate |